On Laslett's transform for the Boolean model
نویسندگان
چکیده
منابع مشابه
On Laslett’s Transform for the Boolean Model
Consider the Boolean model in IR, where the germs form a homogeneous Poisson point process with intensity λ and the grains are convex compact random sets. It is known (see e.g. Section 9.5.3 in Cressie (1993)) that Laslett’s rule transforms the exposed tangent points of the Boolean model into a homogeneous Poisson process with the same intensity λ. In the present paper, we give a simple proof o...
متن کاملthe use of appropriate madm model for ranking the vendors of mci equipments using fuzzy approach
abstract nowadays, the science of decision making has been paid to more attention due to the complexity of the problems of suppliers selection. as known, one of the efficient tools in economic and human resources development is the extension of communication networks in developing countries. so, the proper selection of suppliers of tc equipments is of concern very much. in this study, a ...
15 صفحه اولinvestigating the feasibility of a proposed model for geometric design of deployable arch structures
deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...
“the effect of risk aversion on the demand for life insurance: the case of iranian life insurance market”
abstract: about 60% of total premium of insurance industry is pertained?to life policies in the world; while the life insurance total premium in iran is less than 6% of total premium in insurance industry in 2008 (sigma, no 3/2009). among the reasons that discourage the life insurance industry is the problem of adverse selection. adverse selection theory describes a situation where the inf...
15 صفحه اولLearning Boolean Functions via the Fourier Transform
We survey learning algorithms that are based on the Fourier Transform representa tion In many cases we simplify the original proofs and integrate the proofs of related results We hope that this would give the reader a complete and comprehensive un derstanding of both the results and the techniques Introduction The importance of using the right representation of a function in order to approximat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Probability
سال: 2001
ISSN: 0001-8678,1475-6064
DOI: 10.1017/s0001867800010594